package 剑指Offer;

/**
 * @author zerorain
 * @date 2022/07/10 13:05
 **/
public class Num42 {
    //dp问题
        public int maxSubArray(int[] nums) {
            int[] dp = new int[nums.length];
            dp[0] = nums[0];
            int max = dp[0];
            for(int i=1;i < nums.length;i++){
                dp[i] = Math.max(dp[i-1] + nums[i],nums[i]);
                max = Math.max(max,dp[i]);
            }
            return max;
        }
}